An extension of an approximation problem proposed by K, Itô
نویسندگان
چکیده
منابع مشابه
an investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols
this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...
An Approximation Method for Fuzzy Fixed-Charge Transportation Problem
In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولApproximation Algorithms for the k-center Problem: An Experimental Evaluation
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete location theory. Informally, given a set of cities, with intercity distances specified, one has to pick k cities and build warehouses in them so as to minimize the maximum distance of any city from its closest warehouse. We examine several approximation algorithms that achieve approximation factor ...
متن کاملAn approximation algorithm for the Generalized k-Multicut problem
Given a graph G = (V, E) with nonnegative costs defined on edges, a positive integer k, and a collection of q terminal sets D = {S1, S2, . . . , Sq}, where each Si is a subset of V (G), the Generalized k-Multicut problem asks to find a set of edges C ⊆ E(G) at the minimum cost such that its removal from G cuts at least k terminal sets in D. A terminal subset Si is cut by C if all terminals in S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tohoku Mathematical Journal
سال: 1966
ISSN: 0040-8735
DOI: 10.2748/tmj/1178243479